Stability of Parallel Triangular System Solvers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability of Parallel Triangular System Solvers

Several parallel algorithms have been proposed for the solution of triangular systems. The stability of four of them is analysed here: a fan-in algorithm, a block elimination method, a method based on a factorized power series expansion of the matrix inverse, and a method based on a divide and conquer matrix inversion technique. New forward error and residual bounds are derived, including an im...

متن کامل

Parallel Triangular Solvers on GPU

In this paper, we investigate GPU based parallel triangular solvers systematically. The parallel triangular solvers are fundamental to incomplete LU factorization family preconditioners and algebraic multigrid solvers. We develop a new matrix format suitable for GPU devices. Parallel lower triangular solvers and upper triangular solvers are developed for this new data structure. With these solv...

متن کامل

On Designing Optimal Parallel Triangular Solvers 1

This paper explores the problem of solving triangular linear systems on parallel distributed-memory machines. Working within the LogP model, tight asymptotic bounds for solving these systems using forward/backward substitution are presented. Specifically, lower bounds on execution time independent of the data layout, lower bounds for data layouts in which the number of data items per processor ...

متن کامل

Hybrid Parallel Linear System Solvers

This paper presents a new approach to the solution of nonsymmetric linear systems that uses hybrid techniques based on both direct and iterative methods An implicitly preconditioned modi ed system is obtained by applying projections onto block rows of the original system Our technique provides the exibility of using either direct or iter ative methods for the solution of the preconditioned syst...

متن کامل

On some parallel banded system solvers

We consider algorithms for solving narrow-banded diagonally dominant linear systems which are suitable for multiprocessors. We describe a direct solver similar to that in [12] for tridiagonal systems, and in [9] for solving a banded system on a linearly connected set of processors. We will also provide and analyze a parallel implementation of the partitioning algorithm and the matrix decomposit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 1995

ISSN: 1064-8275,1095-7197

DOI: 10.1137/0916025